A Rejection Technique for Sampling from T-Concave Distributions

نویسنده

  • Wolfgang Hörmann
چکیده

A rejection algorithm { called transformed density rejection { that uses a new method for constructing simple hat functions for an unimodal, bounded density f is introduced. It is based on the idea to transform f with a suitable transformation T such that T (f(x)) is concave. f is then called T-concave and tangents of T (f(x)) in the mode and in a point on the left and right side are used to construct a hat function with table-mountain shape. It is possible to give conditions for the optimal choice of these points of contact. With T = ?1= p x the method can be used to construct a universal algorithm that is applicable to a large class of unimodal distributions including the normal, beta, gamma and t-distribution.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A generalization of the adaptive rejection sampling algorithm

Rejection sampling is a well-known method to generate random samples from arbitrary target probability distributions. It demands the design of a suitable proposal probability density function (pdf) from which candidate samples can be drawn. These samples are either accepted or rejected depending on a test involving the ratio of the target and proposal densities. The adaptive rejection sampling ...

متن کامل

A Universal Generator for Bivariate Log-concave Distributions

Diierent universal (also called automatic or black-box) methods have been suggested to sample from univariate log-concave distributions. The description of a universal generator for bivariate distributions has not been published up to now. The new algorithm for bivariate log-concave distributions is based on the method of transformed density rejection. In order to construct a hat function for a...

متن کامل

Discrete Adaptive Rejection Sampling

Adaptive rejection sampling (ARS) is an algorithm by Gilks and Wild for drawing samples from a continuous log-concave probability distribution with only black-box access to a function that computes the (unnormalized) density function. The ideas extend in a straightforward way to discrete log-concave distributions, but some details of the extension and its implementation can be tricky. This repo...

متن کامل

A Universal Generator for Discrete Log-concave Distributions

We give an algorithm that can be used to sample from any discrete log-concave distribution (e.g. the binomial and hypergeometric distributions). It is based on rejection from a discrete dominating distribution that consists of parts of the geometric distribution. The algorithm is uniformly fast for all discrete log-concave distributions and not much slower than algorithms designed for a single ...

متن کامل

The automatic generation of one- and multi-dimensional distributions with transformed density rejection

A rejection algorithm, called “transformed density rejection”, is presented. It uses a new method for constructing simple hat functions for a unimodal density f . It is based on the idea of transforming f with a suitable transformation T such that T (f(x)) is concave. The hat function is then constructed by taking the pointwise minimum of tangents which are transformed back to the original scal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • ACM Trans. Math. Softw.

دوره 21  شماره 

صفحات  -

تاریخ انتشار 1995